Optimal sequential inspections of reliability systems subject to parallel-chain precedence constraints
نویسندگان
چکیده
منابع مشابه
Uet-scheduling with Chain-type Precedence Constraints Uet|scheduling with Chain-type Precedence Constraints
x{ Scope and Purpose. | We consider a scheduling problem in a two-processor system where (i) every job can be processed on only one machine and where (ii) there are chain-type precedence relations among the jobs. The goal is to minimize the makespan. This continues the work of Chang and Lee 1], Jansen 4] and of Kellerer and Woeginger 5]. Abstract. | We consider a special case of the precedence ...
متن کاملFinding optimal Bayesian networks using precedence constraints
We consider the problem of finding a directed acyclic graph (DAG) that optimizes a decomposable Bayesian network score. While in a favorable case an optimal DAG can be found in polynomial time, in the worst case the fastest known algorithms rely on dynamic programming across the node subsets, taking time and space 2n, to within a factor polynomial in the number of nodes n. In practice, these al...
متن کاملMulti-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کاملQUANTUM VERSION OF TEACHING-LEARNING-BASED OPTIMIZATION ALGORITHM FOR OPTIMAL DESIGN OF CYCLIC SYMMETRIC STRUCTURES SUBJECT TO FREQUENCY CONSTRAINTS
As a novel strategy, Quantum-behaved particles use uncertainty law and a distinct formulation obtained from solving the time-independent Schrodinger differential equation in the delta-potential-well function to update the solution candidates’ positions. In this case, the local attractors as potential solutions between the best solution and the others are introduced to explore the solution space...
متن کاملOptimal Scheduling on Parallel Processors under Precedence Constraints and General Costs
We consider preemptive and nonpreemptive scheduling of partially ordered tasks on parallel processors, where the precedence relations have an interval order, an in-forest, or a uniform out-forest structure. Processing times of tasks are random variables with an ILR (increasing in likelihood ratio) distribution in the nonpreemptive case and an exponential distribution in the preemptive case. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1999
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00097-9